Convex drawings of the complete graph: topology meets geometry

نویسندگان

چکیده

In a geometric drawing of Kn, trivially each 3-cycle bounds convex region: if two vertices are in that region, then so is the (geometric) edge between them. We define topological D Kn to be closed region R such any have (topological) them contained R.While drawings generalize drawings, they specialize ones. Therefore it might surprising all optimal (that is, crossing-minimal) were convex. However, we take first step showing convex: show has non-convex K5 whose extensions K7 no other K5, not (without reference conjecture for crossing number Kn). This example non-trivial local considerations providing sufficient conditions suboptimality. At our request, Aichholzer computationally verified that, up n = 12, every convex.Convexity naturally lends itself refinements, including hereditarily (h-convex) and face (f-convex). The hierarchy rectilinear ? f-convex h-convex provides links drawings. It known equivalent pseudolinear (generalizing rectilinear) pseudospherical spherical geodesic). characterize h-convexity by three forbidden subdrawings.This framework consider generalizations questions point sets plane. provide examples questions, namely numbers empty triangles existence k-gons.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deciding monotonicity of good drawings of the complete graph

We describe an O(n) time algorithm for deciding whether a good drawing of the complete graph Kn, given in terms of its rotation system, can be re-drawn using only x-monotone arcs.

متن کامل

Empty triangles in good drawings of the complete graph

A good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as Jordan arcs connecting their end vertices, and any pair of edges intersects at most once. In any good drawing, the edges of three pairwise connected vertices form a Jordan curve which we call a triangle. We say that a triangle is empty if ...

متن کامل

The convex domination subdivision number of a graph

Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...

متن کامل

Optimal Morphs of Convex Drawings

We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear complexity. The linear bound is asymptotically optimal in the worst case. 1998 ACM Subject Classification G.2.2. Graph Theory

متن کامل

Convex-Arc Drawings of Pseudolines

Introduction. A pseudoline is formed from a line by stretching the plane without tearing: it is the image of a line under a homeomorphism of the plane [13]. In arrangements of pseudolines, pairs of pseudolines intersect at most once and cross at their intersections. Pseudoline arrangements can be used to model sorting networks [1], tilings of convex polygons by rhombi [4], and graphs that have ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ars Mathematica Contemporanea

سال: 2022

ISSN: ['1855-3974', '1855-3966']

DOI: https://doi.org/10.26493/1855-3974.2134.ac9